On Trees with Given Independence Numbers with Maximum Gourava Indices

نویسندگان

چکیده

In mathematical chemistry, molecular descriptors serve an important role, primarily in quantitative structure–property relationship (QSPR) and structure–activity (QSAR) studies. A topological index of a graph is real number that invariant under isomorphism conditions provides information about its size, symmetry, degree branching, cyclicity. For any N, the first second Gourava indices are defined as GO1(N)=∑u′v′∈E(N)(d(u′)+d(v′)+d(u′)d(v′)) GO2(N)=∑u′v′∈E(N)(d(u′)+d(v′))d(u′)d(v′), respectively.The independence being cardinality maximal independent set, plays vital role reading energies chemical trees. this research paper, it shown among family trees order δ ξ, spur tree denoted Υδ,ξ maximizes both 1st 2nd indices, with these characterizations unique.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Ramsey numbers of uniform hypergraphs with given maximum degree

For every > 0 and every positive integers Δ and r , there exists C = C( ,Δ, r) such that the Ramsey number, R(H,H) of any r-uniform hypergraph H with maximum degree at most Δ is at most C|V (H)|1+ . © 2006 Elsevier Inc. All rights reserved.

متن کامل

Trees with equal 2-domination and 2-independence numbers

Let G = (V,E) be a graph. A subset S of V is a 2-dominating set if every vertex of V − S is dominated at least 2 times, and S is a 2-independent set of G if every vertex of S has at most one neighbor in S. The minimum cardinality of a 2-dominating set a of G is the 2-domination number γ2(G) and the maximum cardinality of a 2-independent set of G is the 2-independence number β2(G). Fink and Jaco...

متن کامل

Trees with given maximum degree minimizing the spectral radius

The spectral radius of a graph is the largest eigenvalue of the adjacency matrix of the graph. Let T (n,∆, l) be the tree which minimizes the spectral radius of all trees of order n with exactly l vertices of maximum degree ∆. In this paper, T (n,∆, l) is determined for ∆ = 3, and for l ≤ 3 and n large enough. It is proven that for sufficiently large n, T (n, 3, l) is a caterpillar with (almost...

متن کامل

The Maximum Wiener Index of Trees with Given Degree Sequences

The Wiener index of a connected graph is the sum of topological distances between all pairs of vertices. Since Wang in [23] gave a mistake result on the maximum Wiener index for given tree degree sequence, in this paper, we investigate the maximum Wiener index of trees with given degree sequences and extremal trees which attain the maximum value.

متن کامل

The Variable Wiener Index of Trees with Given Maximum Degree

 The work is supported by Training and plan projects of college students' innovation and pioneering in Guangdong Province(No.1056412059). Abstract Wiener index proposed by Harold Wiener in 1947 is a very important topological index which is widely applied in chemical research. Gutman et al. extended the Wiener index to variable Wiener index. M. H. Liu et al. obtained the maximum variable Wiene...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Symmetry

سال: 2023

ISSN: ['0865-4824', '2226-1877']

DOI: https://doi.org/10.3390/sym15020308